全文获取类型
收费全文 | 2348篇 |
免费 | 160篇 |
国内免费 | 71篇 |
专业分类
化学 | 73篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 29篇 |
数学 | 2374篇 |
物理学 | 98篇 |
出版年
2024年 | 2篇 |
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 44篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 86篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 80篇 |
2013年 | 210篇 |
2012年 | 68篇 |
2011年 | 126篇 |
2010年 | 127篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 138篇 |
2006年 | 146篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 57篇 |
2000年 | 57篇 |
1999年 | 24篇 |
1998年 | 24篇 |
1997年 | 23篇 |
1996年 | 21篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2579条查询结果,搜索用时 28 毫秒
21.
22.
23.
We give a characterization of the cyclic subgroup separability and weak potency of the fundamental group of a graph of polycyclic-by-finite groups and free-by-finite groups amalgamating edge subgroups of the form × D,where h has infinite order and D is finite. 相似文献
24.
25.
26.
The class of cographs is known to have unbounded linear clique‐width. We prove that a hereditary class of cographs has bounded linear clique‐width if and only if it does not contain all quasi‐threshold graphs or their complements. The proof borrows ideas from the enumeration of permutation classes. 相似文献
27.
Tutte's 5‐flow conjecture from 1954 states that every bridgeless graph has a nowhere‐zero 5‐flow. It suffices to prove the conjecture for cyclically 6‐edge‐connected cubic graphs. We prove that every cyclically 6‐edge‐connected cubic graph with oddness at most 4 has a nowhere‐zero 5‐flow. This implies that every minimum counterexample to the 5‐flow conjecture has oddness at least 6. 相似文献
28.
S. Dommers C. Külske P. Schriever 《Stochastic Processes and their Applications》2017,127(11):3719-3753
We study Gibbs distributions of spins taking values in a general compact Polish space, interacting via a pair potential along the edges of a generalized random graph with a given asymptotic weight distribution , obtained by annealing over the random graph distribution.First we prove a variational formula for the corresponding annealed pressure and provide criteria for absence of phase transitions in the general case.We furthermore study classes of models with second order phase transitions which include rotation-invariant models on spheres and models on intervals, and classify their critical exponents. We find critical exponents which are modified relative to the corresponding mean-field values when becomes too heavy-tailed, in which case they move continuously with the tail-exponent of . For large classes of models they are the same as for the Ising model treated in Dommers et al. (2016). On the other hand, we provide conditions under which the model is in a different universality class, and construct an explicit example of such a model on the interval. 相似文献
29.
30.
Let G be a bridgeless cubic graph. Consider a list of k 1‐factors of G. Let be the set of edges contained in precisely i members of the k 1‐factors. Let be the smallest over all lists of k 1‐factors of G. We study lists by three 1‐factors, and call with a ‐core of G. If G is not 3‐edge‐colorable, then . In Steffen (J Graph Theory 78 (2015), 195–206) it is shown that if , then is an upper bound for the girth of G. We show that bounds the oddness of G as well. We prove that . If , then every ‐core has a very specific structure. We call these cores Petersen cores. We show that for any given oddness there is a cyclically 4‐edge‐connected cubic graph G with . On the other hand, the difference between and can be arbitrarily big. This is true even if we additionally fix the oddness. Furthermore, for every integer , there exists a bridgeless cubic graph G such that . 相似文献